Trees with Minimum Weighted Szeged Index Are of a Large Diameter
نویسندگان
چکیده
منابع مشابه
Weighted Szeged Index of Graphs
The weighted Szeged index of a connected graph G is defined as Szw(G) = ∑ e=uv∈E(G) ( dG(u) + dG(v) ) nu (e)n G v (e), where n G u (e) is the number of vertices of G whose distance to the vertex u is less than the distance to the vertex v in G. In this paper, we have obtained the weighted Szeged index Szw(G) of the splice graph S(G1, G2, y, z) and link graph L(G1, G2, y, z).
متن کاملTrees with Given Diameter and Minimum Second Geometric–Arithmetic Index∗
The second geometric-arithmetic index GA2(G) of a graph G was introduced recently by Fath-Tabar et al. [2] and is defined to be ∑ uv∈E(G) √ nu(e,G)nv(e,G) 1 2 [nu(e,G)+nv(e,G)] , where e = uv is one edge in G, and nu(e,G) denotes the number of vertices in G lying closer to u than to v. In this paper, we characterize the tree with the minimum GA2 index among the set of trees with given order and...
متن کاملMinimum weight spanning trees with bounded diameter
Let G be a simple graph with non-negative edge weights. Determining a minimum weight spanning tree is a fundamental problem that arises in network design and as a subproblem in many combinatorial optimization problems such as vehicle routing. In some applications, it is necessary to restrict the diameter of the spanning tree and thus one is interested in the problem : Find, in a given weighted ...
متن کاملMinimum Restricted Diameter Spanning Trees
Let G = (V,E) be a requirements graph. Let d = (dij)i,j=1 be a length metric. For a tree T denote by dT (i, j) the distance between i and j in T (the length according to d of the unique i − j path in T ). The restricted diameter of T , DT , is the maximum distance in T between pair of vertices with requirement between them. The minimum restricted diameter spanning tree problem is to find a span...
متن کاملSpanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree), the weighted degree of a vertex is defined as the sum of the weights of its incident edges. In this paper, we propose a 4.5-approximation algorithm for this problem. We also prove it is NP-hard to approximate this prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12050793